Strongly Regular Graphs Arising From Balanced Incomplete Block Design With λ = 1

نویسنده

  • M. Rajabi Parsa
چکیده

In [M. Klin, A. Munemusa, M. Muzychuk, P.-H. Zieschang Directed strongly regular graphs obtained from coherent algebras. Linear Algebra and its Applications 337, (2004) 83-109] the flag algebra of a given balanced incomplete block design with parameters (ν, b, r, k, λ) where λ = 1, has been constructed. In this paper, we consider the association scheme which is related to this flag algebra. By quotient scheme of this association scheme, we construct a strongly regular graph which its parameters are related to the parameters of given balanced incomplete block design. The parameters of this strongly regular graph are ( kr − r + r k , k(r − 1), r − 2 + (k − 1), k).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Super-Simple Resolvable Balanced Incomplete Block Designs with Block Size 4 and Index 4

The necessary conditions for the existence of a super-simple resolvable balanced incomplete block design on v points with block size k = 4 and index λ = 2, are that v ≥ 16 and v ≡ 4 (mod 12). These conditions are shown to be sufficient. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 341–356, 2007

متن کامل

Balanced colourings of strongly regular graphs

A colouring of a strongly regular graph is an allocation of colours (or treatments) to the vertices of the graph. Such a colouring is balanced if every pair of distinct colours occurs equally often on the ends of an edge. When the graph is the complete regular multipartite graph a balanced colouring is just a balanced incomplete-block design, or 2-design. Some constructions are given. For examp...

متن کامل

Existentially Closed BIBD Block-Intersection Graphs

A graph G with vertex set V is said to be n-existentially closed if, for every S ⊂ V with |S| = n and every T ⊆ S, there exists a vertex x ∈ V − S such that x is adjacent to each vertex of T but is adjacent to no vertex of S − T . Given a combinatorial design D with block set B, its block-intersection graph GD is the graph having vertex set B such that two vertices b1 and b2 are adjacent if and...

متن کامل

Balanced incomplete block designs with block size~9: Part III

The necessary conditions for the existence of a balanced incomplete block design on v points, with index λ and block size k, are that: λ(v − 1) ≡ 0 mod (k − 1) λv(v − 1) ≡ 0 mod k(k − 1) Earlier work has studied k = 9 with λ ∈ {1, 2, 3, 4, 6, 8, 9, 12}. In this article we show that the necessary conditions are sufficient for λ = 9 and every other λ not previously studied.

متن کامل

Construction of BIBD’s Using Quadratic Residues

Definition: Let v, k, and λ be positive integers such that v > k ≥ 2. A (v, k, λ)-balanced incomplete block design (which we abbreviate to (v, k, λ)-BIBD) is a design (X,A) such that the following properties are satisfied: 1. |X| = v, 2. Each block contains exactly k points, and 3. Every pair of distinct points is contained in exactly λ blocks. Property 3 in the definition above is the “balance...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014